An extremal problem on potentially Kr,s-graphic sequences
نویسندگان
چکیده
منابع مشابه
An Extremal Problem On Potentially Kr+1-H-graphic Sequences
A sequence S is potentially Kp,1,1 graphical if it has a realization containing a Kp,1,1 as a subgraph, where Kp,1,1 is a complete 3-partite graph with partition sizes p, 1, 1. Let σ(Kp,1,1, n) denote the smallest degree sum such that every n-term graphical sequence S with σ(S) ≥ σ(Kp,1,1, n) is potentially Kp,1,1 graphical. In this paper, we prove that σ(Kp,1,1, n) ≥ 2[((p + 1)(n − 1) + 2)/2] ...
متن کامل2 00 4 An extremal problem on potentially K m − C 4 - graphic sequences ∗
A sequence S is potentially Km−C4 graphical if it has a realization containing a Km−C4 as a subgraph. Let σ(Km−C4, n) denote the smallest degree sum such that every n-term graphical sequence S with σ(S) ≥ σ(Km−C4, n) is potentially Km−C4 graphical. In this paper, we prove that σ(Km−C4, n) ≥ (2m−6)n−(m−3)(m−2)+2, for n ≥ m ≥ 4. We conjectured that equality holds for n ≥ m ≥ 4. We proved that thi...
متن کاملA ug 2 00 4 An extremal problem on potentially K p , 1 , 1 - graphic sequences ∗
A sequence S is potentially Kp,1,1 graphical if it has a realization containing a Kp,1,1 as a subgraph, where Kp,1,1 is a complete 3partite graph with partition sizes p, 1, 1. Let σ(Kp,1,1, n) denote the smallest degree sum such that every n-term graphical sequence S with σ(S) ≥ σ(Kp,1,1, n) is potentially Kp,1,1 graphical. In this paper, we prove that σ(Kp,1,1, n) ≥ 2[((p + 1)(n − 1) + 2)/2] f...
متن کاملSe p 20 04 An extremal problem on potentially K m − P k - graphic sequences ∗
A sequence S is potentially Km−Pk graphical if it has a realization containing a Km −Pk as a subgraph. Let σ(Km −Pk, n) denote the smallest degree sum such that every n-term graphical sequence S with σ(S) ≥ σ(Km−Pk, n) is potentially Km−Pk graphical. In this paper, we prove that σ(Km−Pk, n) ≥ (2m−6)n−(m−3)(m−2)+2, for n ≥ m ≥ k + 1 ≥ 4. We conjectured that equality holds for n ≥ m ≥ k + 1 ≥ 4. ...
متن کاملul 2 00 6 An extremal problem on potentially K m − P k - graphic sequences ∗
A sequence S is potentially Km−Pk graphical if it has a realization containing a Km −Pk as a subgraph. Let σ(Km −Pk, n) denote the smallest degree sum such that every n-term graphical sequence S with σ(S) ≥ σ(Km−Pk, n) is potentially Km−Pk graphical. In this paper, we prove that σ(Km−Pk, n) ≥ (2m−6)n−(m−3)(m−2)+2, for n ≥ m ≥ k + 1 ≥ 4. We conjecture that equality holds for n ≥ m ≥ k + 1 ≥ 4. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2003
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00765-3